Permutation reconstruction from MinMax-Betweenness constraints
نویسندگان
چکیده
منابع مشابه
Permutation Reconstruction from MinMax-Betweenness Constraints
In this paper, we investigate the reconstruction of permutations on {1, 2, . . . , n} from betweenness constraints involving the minimum and the maximum element located between t and t + 1, for all t = 1, 2, . . . , n − 1. We propose two variants of the problem (directed and undirected), and focus first on the directed version, for which we draw up general features and design a polynomial algor...
متن کاملReconstruction of Networks from Their Betweenness Centrality
In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the dissemination of information over the network. We consider a simple metaheuristic, simulated annealing, as the combinatorial optimization method to generate the network from the values of the betweenness centrality. We compare the ...
متن کاملPermutation Reconstruction from Differences
We prove that the problem of reconstructing a permutation π1, . . . , πn of the integers [1 . . . n] given the absolute differences |πi+1 − πi|, i = 1, . . . , n − 1 is NP– complete. As an intermediate step we first prove the NP–completeness of the decision version of a new puzzle game that we call Crazy Frog Puzzle. The permutation reconstruction from differences is one of the simplest combina...
متن کاملPermutation Reconstruction from Minors
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible way to obtain (n k ) subsequences. We renumber the sequences from 1 to n−k preserving the relative size of the elements to form (n−k)-minors. These minors form a multiset Mk(p) with an underlying set M ′ k(p). We study ...
متن کاملOn Random Betweenness Constraints
Ordering constraints are formally analogous to instances of the satisfiability problem in conjunctive normal form, but instead of a boolean assignment we consider a linear ordering of the variables in question. A clause becomes true given a linear ordering iff the relative ordering of its variables obeys the constraint considered. The naturally arising satisfiability problems are NP-complete fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.03.008